Regular Path Expression in Feature Logic
نویسنده
چکیده
We examine the existential fragment of a feature logic, which is extended by regular path expressions. A regular path expression is a subterm relation, where the allowed paths for the subterms are restricted to any given regular language. In the area of computational linguistics, this notion has been introduced as \functional uncertainty". We will prove that satissability is decidable by constructing a quasi-terminating rule system.
منابع مشابه
Querying the Unary Negation Fragment with Regular Path Expressions
The unary negation fragment of first-order logic (UNFO) has recently been proposed as a generalization of modal logic that shares many of its good computational and model-theoretic properties. It is attractive from the perspective of database theory because it can express conjunctive queries (CQs) and ontologies formulated in many description logics (DLs). Both are relevant for ontology-mediate...
متن کاملOn the Count of Trees
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on frameworks for reasoning about path expressions where node cardinality constraints occur along a path in a tree. We present a logic capable of expressing deep counting along paths which may include arbitrary r...
متن کاملA Tree Logic with Graded Paths and Nominals
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on reasoning frameworks for path expressions where node cardinality constraints occur along a path in a tree. We present a logic capable of expressing deep counting along paths which may include arbitrary recursi...
متن کاملA Methodology for Synthesis of Data Path Circuitse
tioned into data path and control blocks. The data path block performs Boolean (AND, OR, XOR) or arithmetic (ADD, SHIFT, MULTIPLY) operations on data and address buses. Control logic generates signals that control the data path’s operation. Control logic is usually very random, whereas data path logic is highly regular because it performs similar operations on different bits of the same bus. De...
متن کاملOn the Decidability of Functional Uncertainty
We show that feature logic extended by functional uncertainty is decidable, even if one admits cyclic descriptions. We present an algorithm, which solves feature descriptions containing functional uncertainty in two phases, both phases using a set of de-terministic and non-deterministic rewrite rules. We then compare our algorithm with the one of Kaplan and Maxwell, that does not cover cyclic f...
متن کامل